t=int(input())
import math
for i in range(t):
a,v,l,r=map(int,input().split())
b=a//v
c=math.ceil(l/v)
d=math.floor(r//v)
print(b-d+c-1)#include <bits/stdc++.h>
using namespace std;
void MOUST(){
ios_base::sync_with_stdio(0);
cin.tie(0);
}
int main(){
MOUST();
int Q;cin>>Q;
while(Q--){
long long L,V,l,r;cin>>L>>V>>l>>r;
cout<<L/V-(r/V-(l-1)/V)<<"\n";
}
}
445. Add Two Numbers II | 442. Find All Duplicates in an Array |
437. Path Sum III | 436. Find Right Interval |
435. Non-overlapping Intervals | 406. Queue Reconstruction by Height |
380. Insert Delete GetRandom O(1) | 332. Reconstruct Itinerary |
368. Largest Divisible Subset | 377. Combination Sum IV |
322. Coin Change | 307. Range Sum Query - Mutable |
287. Find the Duplicate Number | 279. Perfect Squares |
275. H-Index II | 274. H-Index |
260. Single Number III | 240. Search a 2D Matrix II |
238. Product of Array Except Self | 229. Majority Element II |
222. Count Complete Tree Nodes | 215. Kth Largest Element in an Array |
198. House Robber | 153. Find Minimum in Rotated Sorted Array |
150. Evaluate Reverse Polish Notation | 144. Binary Tree Preorder Traversal |
137. Single Number II | 130. Surrounded Regions |
129. Sum Root to Leaf Numbers | 120. Triangle |